K5-Subdivisions in graphs containing K-4
نویسندگان
چکیده
Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5. In this paper, we prove this conjecture for graphs containing K− 4 . AMS Subject Classification: 05C
منابع مشابه
Independent paths and K5-subdivisions
A well known theorem of Kuratowski states that a graph is planar iff it contains no subdivision of K5 or K3,3. Seymour conjectured in 1977 that every 5-connected nonplanar graph contains a subdivision of K5. In this paper, we prove several results about independent paths (no vertex of a path is internal to another), which are then used to prove Seymour’s conjecture for two classes of graphs. Th...
متن کاملThe structure of K3, 3-subdivision-free toroidal graphs
We describe the structure of 2-connected non-planar toroidal graphs with no K3,3-subdivisions, using an appropriate substitution of planar networks into the edges of certain graphs called toroidal cores. The structural result is based on a refinement of the algorithmic results for graphs containing a fixed K5-subdivision in [A. Gagarin and W. Kocay, “Embedding graphs containing K5-subdivisions”...
متن کاملEmbedding Graphs Containing K5-Subdivisions
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partition of the vertices of G\K5 into equivalence classes. As a result, we can reduce a projective planarity or toroidality algorithm to a small constant number of simple planarity checks [6] or to a K3,3-subdivision in the...
متن کاملCounting Labelled Projective-planar Graphs without a K 3,3 -subdivision *
We consider the class F of labelled 2-connected non-planar graphs without a K3,3-subdivision that are embeddable in the projective plane. A method of enumerating these graphs is described. We also enumerate the homeomorphically irreducible graphs in F and homeomorphically irreducible 2-connected planar graphs. The methods are based on the projective-planarity characterization for graphs without...
متن کاملDefective Choosability of Graphs without Small Minors
For each proper subgraph H of K5, we determine all pairs (k, d) such that every H-minor-free graph is (k, d)-choosable or (k, d)-choosable. The main structural lemma is that the only 3-connected (K5 − e)-minor-free graphs are wheels, the triangular prism, and K3,3; this is used to prove that every (K5 − e)-minor-free graph is 4-choosable and (3, 1)-choosable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 103 شماره
صفحات -
تاریخ انتشار 2013